Learning Nonlinear Mixtures: Identifiability and Algorithm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonparametric Identifiability of Finite Mixtures

Finite mixture models are useful in applied econometrics. They can be used to model unobserved heterogeneity, which plays major roles in labor economics, industrial organization and other fields. Mixtures are also convenient in dealing with contaminated sampling models and models with multiple equilibria. Most of the currently available estimation methods for mixtures are entirely parametric; o...

متن کامل

An efficient algorithm for testing nonlinear dynamical model identifiability

This paper is concerned by the analysis of nonlinear controlled or uncontrolled dynamical model identifiability. The proposed approach is based on the construction of an input-output ideal. The aim is to develop an algorithm which gives identifiability results from this approach. Differential algebra theory allows realization of such a project. In order to state the algorithm, new results of di...

متن کامل

Identifiability of finite mixtures of elliptical distributions

We present general results on the identifiability of finite mixtures of elliptical distributions under conditions on the characteristic generators or density generators. Examples include the multivariate t distribution, symmetric stable laws, exponential power and Kotz distributions. In each case, the shape parameter is allowed to vary in the mixture, in addition to the location vector and the ...

متن کامل

On the identifiability of mixtures-of-experts

In mixtures-of-experts (ME) models, "experts" of generalized linear models are combined, according to a set of local weights called the "gating function". The invariant transformations of the ME probability density functions include the permutations of the expert labels and the translations of the parameters in the gating functions. Under certain conditions, we show that the ME systems are iden...

متن کامل

Identifiability of 3-Class Jukes-Cantor Mixtures

We prove identifiability of the tree parameters of the 3-class Jukes-Cantor mixture model. The proof uses ideas from algebraic statistics, in particular: finding phylogenetic invariants that separate the varieties associated to different triples of trees; computing dimensions of the resulting phylogenetic varieties; and using the disentangling number to reduce to trees with a small number of le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2020

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2020.2989551